package com.求拼凑纸钱;
//回溯法
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Solution {
	public static void main(String[] args) {
        
        Scanner scan = new Scanner(System.in);
        int n = scan.nextInt();
        System.out.println(find(n));
	}
	static List<List<Integer>> result = new ArrayList<List<Integer>>();
	public static int find(int n) {
		int[] money = new int[]{1,5,10,20,50,100};
		List<Integer> list = new ArrayList<Integer>();
		count(money,n,0,list);
		
		return result.size();
	}
	public static void count(int[]m,int n,int start,List<Integer> list) {
		
		if(n<0)return;
		else if(n==0)result.add(new ArrayList(list));
		else {
			for(int i=start;i<m.length;i++) {
	            
				list.add(m[i]);
				count(m,n-m[i],i,list);
				list.remove(list.size()-1);
			}
		}
	}

}
